Nonnegative matrices having nonnegative Drazin pseudoinverses

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nonnegative Matrices

For a loopless, acyclic, transitive directed graph S, we study the relations between the predecessor property and the well structured property on S. These properties assure the existence of nonnegativ€ Jordan bases for any nonnegative matrix with singular graph S.

متن کامل

Monotonicity of Nonnegative Matrices

We present a nonnegative rank factorization of a nonnegative matrix A for the case in which one or both of A(1)A and AA(1) are nonnegative. This gives, in particular, a known result for characterizing nonnegative matrices when A†A or AA† is nonnegative. We applied this characterization to the derivation of known results based on the characterization of nonnegative monotone matrices. A matrix A ...

متن کامل

Nonnegative Ranks, Decompositions, and Factorizations of Nonnegative Matrices

The nonnegative rank of a nonnegative matrix is the smallest number of nonnegative rank-one matrices into which the matrix can be decomposed additively. Such decompositions are useful in diverse scientific disciplines. We obtain characterizations and bounds and show that the nonnegative rank can be computed exactly over the reals by a finite algorithm.

متن کامل

Infinite Products of Nonnegative 2× 2 Matrices by Nonnegative Vectors

Given a finite set {M0, . . . ,Md−1} of nonnegative 2× 2 matrices and a nonnegative column-vector V , we associate to each (ωn) ∈ {0, . . . , d− 1}N the sequence of the column-vectors Mω1 . . .MωnV ‖Mω1 . . .MωnV ‖ . We give the necessary and sufficient condition on the matrices Mk and the vector V for this sequence to converge for all (ωn) ∈ {0, . . . , d− 1}N such that ∀n, Mω1 . . .MωnV 6= ( ...

متن کامل

On Reduced Rank Nonnegative Matrix Factorization for Symmetric Nonnegative Matrices

Let V ∈ R be a nonnegative matrix. The nonnegative matrix factorization (NNMF) problem consists of finding nonnegative matrix factors W ∈ R and H ∈ R such that V ≈ WH. Lee and Seung proposed two algorithms which find nonnegative W and H such that ‖V −WH‖F is minimized. After examining the case in which r = 1 about which a complete characterization of the solution is possible, we consider the ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1980

ISSN: 0024-3795

DOI: 10.1016/0024-3795(80)90238-4